Vertical Fragmentation and Allocation in Distributed Deductive Database Systems

Although approaches for vertical fragmentation and data allocation have been proposed 13, 16], algorithms for vertical fragmentation and allocation of data and rules in distributed deductive database systems (DDDBSs) are lacking. In this paper, we present diierent approaches for vertical fragmentation of relations that are referenced by rules and an allocation strategy for rules and fragments in a DDDBS. The potential advantages of the proposed fragmentation and allocation scheme include maximal locality of query evaluation and minimization of communication cost in a distributed system, in addition to the desirable properties of (vertical) fragmentation and rule allocation as discussed in the literature 11, 12]. We also formulate the mathematical interpretation of the proposed vertical fragmentation and allocation algorithms.